A Combinatorial Perspective on the Non-Radon Partitions
نویسنده
چکیده
Let E be a finite set of points in IWd. Then {A, EA} is a non-Radon partition of E i f f there is a hyperplane H separating A strictly from E A. Or equivalently i f f ,-0 is an acyclic reorientation of (M,,(E), 0). the oriented matroid canonically determined by E. If (M(E), (0) is an oriented matroid without loops then the set NR(E, fl) = {(A, E-A): ,-B is acyclic} determines (M(E), 0). In particular the matroidal properties of a finite set of points in IWd are precisely the properties which can be formulated in non-Radon partitions terms. The Mobius function of the poset .01= {A: A G E, ,-I? is acyclic) and in a special case its homotopy type are computed. This paper generalizes recent results of P. Edelman (A partial order on the regions of aB” dissected by hyperplanes, Trans. Amer. Math. Sot. 283 (1984), no. 2, 617631. I(‘, 1985 Academic Press, Inc.
منابع مشابه
Combinatorial Statistics on Non-crossing Partitions
Four statistics, ls, rb, rs, and lb, previously studied on all partitions of { 1, 2, ..., n }, are applied to non-crossing partitions. We consider single and joint distributions of these statistics and prove equidistribution results. We obtain qand p, q-analogues of Catalan and Narayana numbers which refine the rank symmetry and unimodality of the lattice of non-crossing partitions. Two unimoda...
متن کاملFree Probability Theory and Non-crossing Partitions
Voiculescu's free probability theory { which was introduced in an operator algebraic context, but has since then developed into an exciting theory with a lot of links to other elds { has an interesting combinatorial facet: it can be described by the combinatorial concept of multiplicative functions on the lattice of non-crossing partitions. In this survey I want to explain this connection { wit...
متن کاملSéminaire Lotharingien de Combinatoire, B39c(1997), 38pp. FREE PROBABILITY THEORY AND NON-CROSSING PARTITIONS
Voiculescu’s free probability theory – which was introduced in an operator algebraic context, but has since then developed into an exciting theory with a lot of links to other fields – has an interesting combinatorial facet: it can be described by the combinatorial concept of multiplicative functions on the lattice of non-crossing partitions. In this survey I want to explain this connection – w...
متن کاملTotal Polynomials of Uniform Oriented Matroids
In this paper we introduce polynomials associated with uniform oriented matroids whose coefficients enumerate cells in the corresponding arrangements. These polynomials are quite useful in the study of many enumeration problems of combinatorial geometry, such as counting faces of polytopes, counting Radon partitions, counting k-sets, and so forth. We also describe some striking equations relati...
متن کاملOn the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice
The following integer analogue of a Radon partition in affine space rd is studied: A partition (S, T) of a set of integer points in ,]d is an integral Radon partition if the convex hulls of S and T have an integer point in common. The Radon number r(d) of an appropriate convexity space on the integer lattice Zd is then the infimum over those natural numbers n such that any set of n points or mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 38 شماره
صفحات -
تاریخ انتشار 1985